A New Method Based On Modified Shuffled Frog Leaping Algorithm In Order To Solve Nonlinear Large Scale Problem
نویسندگان
چکیده
In order to handle large scale problems, this study has used shuffled frog leaping algorithm. This algorithm is an optimization method based on natural memetics that uses a new two-phase modification to it to have a better search in the problem space. The suggested algorithm is evaluated by comparing to some well known algorithms using several benchmark optimization problems. The simulation results have clearly shown the superiority of this algorithm over other well-known methods in the area.
منابع مشابه
Using the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement
Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملCombined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm
Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملA new evolutionary algorithm for non-linear economic dispatch
0957-4174/$ see front matter 2011 Elsevier Ltd. A doi:10.1016/j.eswa.2011.04.151 ⇑ Corresponding author. Tel.: +98 711 7264121; fax E-mail addresses: [email protected] (T. Niknam Firouzi), [email protected] (H.D. Mojarrad). Reduce fossil fuel resources; increasing established new power generation unit costs; and ever growing demand for electric energy necessitate optimal economic dispatc...
متن کامل